package features.advance.leetcode.dynamicProgramming.other;

/**
 * @author LIN
 * @date 2022-02-28 16:59
 */
public class Office {

    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 6, 7, 9, 11, 22, 44, 50};
        int num = 5;
        int[][] w = new int[arr.length+1][arr.length+1];
        

    }

    static class Solution {

    }
}
